Combinatorial proofs for some forest hook length identities
نویسنده
چکیده
Chen, Gao and Guo gave in a recent paper many interesting identities involving hook lengths of trees and forests using an extension of Han’s expansion technique. We give combinatorial proofs of some of these identities.
منابع مشابه
On Han's Hook Length Formulas for Trees
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...
متن کاملA Combinatorial Proof of an Identity for the Divisor Generating Function
In this paper, we give combinatorial proofs and new generalizations of q-series identities of Dilcher and Uchimura related to divisor function. Some interesting combinatorial results related to partition and arm length are also presented.
متن کاملBijections for Hook Pair Identities
Short, bijective proofs of identities for multisets of ‘hook pairs’ (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally found by Regev.
متن کامل1 99 9 Bijections for Hook Pair Identities
Short, bijective proofs of identities for multisets of ‘hook pairs’ (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally found by Regev.
متن کاملCombinatorial Proofs of Hook Generating Functions for Skew Plane Partitions
Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...
متن کامل